A variant of Steffensen-King's type family with accelerated sixth-order convergence and high efficiency index: Dynamic study and approach

نویسندگان

  • Taher Lotfi
  • Ángel Alberto Magreñán
  • Katayoun Mahdiani
  • J. Javier Rainer
چکیده

Keywords: Multipoint iterative methods Steffensen's method King's family Derivative-free Efficiency index a b s t r a c t First, it is attempted to derive an optimal derivative-free Steffensen–King's type family without memory for computing a simple zero of a nonlinear function with efficiency index 4 1=3 % 1:587. Next, since our without memory family includes a parameter in which it is still possible to increase the convergence order without any new function evaluations. Therefore, we extract a new method with memory so that the convergence order rises to six without any new function evaluation and therefore reaches efficiency index 6 1=3 % 1:817. Consequently, derivative-free and high efficiency index would be the substantial contributions of this work as opposed to the classical Steffensen's and King's methods. Finally, we compare some of the convergence planes with different weight functions in order to show which are the best ones. Construction and development of Multipoint methods without memory, for computing a simple or multiple roots of a given nonlinear function, is based on Kung and Traub's conjecture [12], proved in some special cases [22,25,26]. It is supposed that any multipoint method without memory by using n function evaluations per iteration can reach optimal convergence order 2 n. The most well known optimal method is Newton's method [2] but we are interested in two-point methods. There are some legendary optimal two-point methods without memory like King's [10], Ostrowski's [16] and Jarratt's [7,8,14] methods in which they consume three function evaluations per iteration with optimal convergence four. In spite being optimal, they require evaluation of the first derivative at one or two points and hence cannot be used for nonsmooth functions. Needless to say, King's and Ostrowski's type methods have been considerably used to create higher optimal order methods without memory on the other hand, based our best knowledge, there is no higher optimal order of Jarratt's type method. In this work, King's family is modified to avoid using derivative evaluation and consequently can be applied to nonsmooth functions. To this end, its first step is replaced by an Steffensen's type method [19] and its second step is altered by considering the idea of weight function. It is attempted to preserve optimality, too. Until now, this modified family can be called a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Steffensen-like Methods with Memory for Solving Nonlinear Equations with the Highest Possible Efficiency Indices

The primary goal of this work is to introduce two adaptive Steffensen-like methods with memory of the highest efficiency indices. In the existing methods, to improve the convergence order applied to memory concept, the focus has only been on the current and previous iteration. However, it is possible to improve the accelerators. Therefore, we achieve superior convergence orders and obtain as hi...

متن کامل

Optimized Steffensen-Type Methods with Eighth-Order Convergence and High Efficiency Index

Steffensen-type methods are practical in solving nonlinear equations. Since, such schemes do not need derivative evaluation per iteration. Hence, this work contributes two new multistep classes of Steffensen-type methods for finding the solution of the nonlinear equation f x 0. New techniques can be taken into account as the generalizations of the one-step method of Steffensen. Theoretical proo...

متن کامل

A Six-order Variant of Newton’s Method for Solving Nonlinear Equations

A new variant of Newton's method based on contra harmonic mean has been developed and its convergence properties have been discussed. The order of convergence of the proposed method is six. Starting with a suitably chosen x0, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of convergence. In terms of computati...

متن کامل

A Six-order Modification of Newton’s Method For Solving Nonlinear Equations

A new six order variant of Newton’s method has been developed by extending a third order method of Ozban [14] and its convergence properties have been discussed. The order of convergence of the proposed method is six. Starting with a suitably chosen x0, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of conver...

متن کامل

A SIXTH ORDER METHOD FOR SOLVING NONLINEAR EQUATIONS

In this paper, we present a new iterative method with order of convergence eighth for solving nonlinear equations. Periteration this method requires three evaluations of the function and one evaluation of its first derivative. A general error analysis providing the eighth order of convergence is given. Several numerical examples are given to illustrate the efficiency and performance of the new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 252  شماره 

صفحات  -

تاریخ انتشار 2015